Learning Regular Languages Using Nondeterministic Finite Automata
نویسندگان
چکیده
A new general method for inference of regular languages using nondeterministic automata as output has recently been developed and proved to converge. The aim of this paper is to describe and analyze the behavior of two implementations of that method and to compare it with two well known algorithms for the same task. A complete set of experiments has been carried out and the results of the new algorithms improve the existing ones both in recognition rates as in sizes of the output automata.
منابع مشابه
Learning Regular Languages via Alternating Automata
Nearly all algorithms for learning an unknown regular language, in particular the popular L∗ algorithm, yield deterministic finite automata. It was recently shown that the ideas of L∗ can be extended to yield non-deterministic automata, and that the respective learning algorithm, NL∗, outperforms L∗ on randomly generated regular expressions. We conjectured that this is due to the existential na...
متن کاملSimplifying Nondeterministic Finite Cover Automata
The concept of Deterministic Finite Cover Automata (DFCA) was introduced at WIA ’98, as a more compact representation than Deterministic Finite Automata (DFA) for finite languages. In some cases representing a finite language, Nondeterministic Finite Automata (NFA) may significantly reduce the number of states used. The combined power of the succinctness of the representation of finite language...
متن کاملT F L T C E F L
We survey recent results on the enumeration of formal languages. In particular, we consider enumeration of regular languages accepted by deterministic and nondeterministic finite automata with n states, regular languages generated by regular expressions of a fixed length, and ω-regular languages accepted by Müller automata. We also survey the uncomputability of enumeration of context-free langu...
متن کاملFamilies of DFAs as Acceptors of $ω$-Regular Languages
Families of dfas (fdfas) provide an alternative formalism for recognizing ω-regular languages. The motivation for introducing them was a desired correlation between the automaton states and right congruence relations, in a manner similar to the Myhill-Nerode theorem for regular languages. This correlation is beneficial for learning algorithms, and indeed it was recently shown that ω-regular lan...
متن کاملFamilies of DFAs as Acceptors of omega-Regular Languages
Families of dfas (fdfas) provide an alternative formalism for recognizing ωregular languages. The motivation for introducing them was a desired correlation between the automaton states and right congruence relations, in a manner similar to the MyhillNerode theorem for regular languages. This correlation is beneficial for learning algorithms, and indeed it was recently shown that ω-regular langu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008